Dirichlet densifiers for improved commute times estimation
نویسندگان
چکیده
منابع مشابه
Dirichlet Graph Densifiers
In this paper, we propose a graph densification method based on minimizing the combinatorial Dirichlet integral for the line graph. This method allows to estimate meaningful commute distances for midsize graphs. It is fully bottom up and unsupervised, whereas anchor graphs, the most popular alternative, are top-down. Compared with anchor graphs, our method is very competitive (it is only outper...
متن کاملImage Segmentation using Commute Times
This paper exploits the properties of the commute time to develop a graphspectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed ...
متن کاملLollipop graphs are extremal for commute times
Consider a simple random walk on a connected graph G = (V; E). Let C(u; v) be the expected time taken for the walk starting at vertex u to reach vertex v and then go back to u again, i.e. the commute time for u and v, and
متن کاملCommute times of random walks on trees
In this paper we provide exact formula for the commute times of random walks on spherically symmetric random trees. Using this formula we sharpen some of the results presented in Al-Awadhi et al to the form of equalities rather than inequalities.
متن کاملCommute Times for a Directed Graph using an Asymmetric Laplacian
The expected commute times for a strongly connected directed graph are related to an asymmetric Laplacian matrix as a direct extension to similar well known formulas for undirected graphs. We show the close relationships between the asymmetric Laplacian and the so-called Fundamental matrix. We give bounds for the commute times in terms of the stationary probabilities for a random walk over the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2019
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2019.02.012